Decentralized Subspace Tracking via Gossiping.

Discriminative training methods for language models using conditional entropy criteria.

Paraphrase detection on SMS messages in automobiles.

An Ontology%2Dbased Mapping Repository for Meta%2Dquerier Customization.

Precomputing search features for fast and accurate query classification.

Automatic extraction of clickable structured web contents for name entity queries.

Learning with click graph for query intent classification.

Near%2Doptimal power allocation for MIMO channels with mean or covariance feedback.

Timing estimation and resynchronization for amplify%2Dand%2D forward communication systems.

Capacity bounds and low complexity transceiver design for double%2Dscattering MIMO multiple access channels.

Capacity of MIMO%2DMAC with transmit channel knowledge in the low SNR regime.

CFO estimation in OFDM systems under timing and channel length uncertainties with model averaging.

Semi%2Dsupervised learning of semantic classes for query understanding from the web and for the web.
Understanding intents from search queries can improve a user’s search experience and boost a site’s advertising profits. Query tagging via statistical sequential labeling models has been shown to perform well, but annotating the training set for supervised learning requires substantial human effort. Domain-specific knowledge, such as semantic class lexicons, reduces the amount of needed manual annotations, but much human effort is still required to maintain these as search topics evolve over time. This paper investigates semi-supervised learning algorithms that leverage structured data (HTML lists) from the Web to automatically generate semantic-class lexicons, which are used to improve query tagging performance – even with far less training data. We focus our study on understanding
Product query classification.

TPL A Data Layout Method for Reducing Rotational Latency of Modern Hard Disk Drive.

On the Use of Virtual Evidence in Conditional Random Fields.

Discovery of Term Variation in Japanese Web Search Queries.
In this paper we address the problem of identifying a broad range of term variations in Japanese web search queries, where these variations pose a particularly thorny problem due to the multiple character types employed in its writing system. Our method extends the techniques proposed for English spelling correction of web queries to handle a wider range of term variants including spelling mistakes, valid alternative spellings using multiple character types, transliterations and abbreviations. The core of our method is a statistical model built on the MART algorithm (Friedman, 2001). We show that both string and semantic similarity features contribute to identifying term variation in web search queries; specifically, the semantic similarity features used in our system are learned by mining user session and click-through logs, and are useful not only as model features but also in generating term variation candidates efficiently. The proposed method achieves 70 % precision on the term variation identification task with the recall slightly higher than 60%, reducing the error rate of a naïve baseline by 38%. 1
Numerical Study of Rock%2DSoil Aggregate by Discrete Element Modeling.

A New Constant Storage Self%2Dhealing Key Distribution with Revocation in Wireless Sensor Networks.

Multiuser MIMO%2DMAC capacity in the low SNR regime Channel knowledge and double%2Dscattering.

Leveraging multiple query logs to improve language models for spoken query recognition.
A voice search system requires a speech interface that can correctly recognize spoken queries uttered by users. The recognition performance strongly relies on a robust language model. In this work, we present the use of multiple data sources, with the focus on query logs, in improving ASR language models for a voice search application. Our contributions are three folds: (1) the use of text queries from web search and mobile search in language modeling; (2) the use of web click data to predict query forms from business listing forms; and (3) the use of voice query logs in creating a positive feedback loop. Experiments show that by leveraging these resources, we can achieve recognition performance comparable to, or even better than, that of a previously deploy system where a large amount of spoken query transcripts are used in language modeling. Index Terms — language modeling, voice search, query log, click data
A flat direct model for speech recognition.
We introduce a direct model for speech recognition that assumes an unstructured, i.e., flat text output. The flat model allows us to model arbitrary attributes and dependences of the output. This is different from the HMMs typically used for speech recognition. This conventional modeling approach is based on sequential data and makes rigid assumptions on the dependences. HMMs have proven to be convenient and appropriate for large vocabulary continuous speech recognition. Our task under consideration, however, is the Windows Live Search for Mobile (WLS4M) task [1]. This is a cellphone application that allows users to interact with web-based information portals. In particular, the set of valid outputs can be considered discrete and finite (although probably large, i.e., unseen events are an issue). Hence, a flat direct model lends itself to this task, making the adding of different knowledge sources and dependences straightforward and cheap. Using e.g. HMM posterior, m-gram, and spotter features, significant improvements over the conventional HMM system were observed. Index Terms — maximum entropy, language model, nearest neighbor, voice search, speech recognition
Low SNR Capacity of Double%2DScattering MIMO Channels with Transmitter Channel Knowledge.

A Framework for Error%2DTolerant Scheme in Pervasive Computing.

Dynamic Personalization for Meta%2DQueriers.

Dynamic Personalization for Meta%2DQueriers.

Design of two%2Dwheel self%2Dbalanced electric vehicle based on MEMS.

Smoothing clickthrough data for web search ranking.
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web search applications. Such benefits, however, are severely limited by the data sparseness problem, i.e., many queries and documents have no or very few clicks. The ranker thus cannot rely strongly on clickthrough features for document ranking. This paper presents two smoothing methods to expand clickthrough data: query clustering via Random Walk on click graphs and a discounting method inspired by the Good-Turing estimator. Both methods are evaluated on real-world data in three Web search domains. Experimental results show that the ranking models trained on smoothed clickthrough features consistently outperform those trained on unsmoothed features. This study demonstrates both the importance and the benefits of dealing with the sparseness problem in clickthrough data.
Extracting structured information from user queries with semi%2Dsupervised conditional random fields.
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step toward this goal, we study the problem of query tagging which is to assign each query term to a pre-defined category. Our problem could be approached by learning a conditional random field (CRF) model (or other statistical models) in a supervised fashion, but this would require substantial human-annotation effort. In this work, we focus on a semi-supervised learning method for CRFs that utilizes two data sources: (1) a small amount of manually-labeled queries, and (2) a large amount of queries in which some word tokens have derived labels, i.e., label information automatically obtained from additional resources. We present two principled ways of encoding derived label information in a CRF model. Such information is viewed as hard evidence in one setting and as soft evidence in the other. In addition to the general methodology of how to use derived labels in semi-supervised CRFs, we also present a practical method on how to obtain them by leveraging user click data and an in-domain database that contains structured documents. Evaluation on product search queries shows the effectiveness of our approach in improving tagging accuracies.
Bayesian CFO estimation in OFDM systems.

On performance bounds for timing estimation under fading channels.

Statistical Eigenmode Transmission over Jointly%2DCorrelated MIMO Channels

Novel modified fuzzy c%2Dmeans algorithm with applications.

Statistical eigenmode transmission over jointly correlated MIMO channels.

Timing Synchronization in Decode%2Dand%2DForward Cooperative Communication Systems.

Language modeling for voice search A machine translation approach.

Near%2DOptimal Power Allocation for MIMO Systems with Partial CSI Feedback.

Study and Application of Key Technologies of LAN Remote Control.

Learning query intent from regularized click graphs.
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a unified user interface. Previous works on query classification have primarily focused on improving feature representation of queries, e.g., by augmenting queries with search engine results. In this work, we investigate a completely orthogonal approach — instead of enriching feature representation, we aim at drastically increasing the amounts of training data by semi-supervised learning with click graphs. Specifically, we infer class memberships of unlabeled queries from those of labeled ones according to their proximities in a click graph. Moreover, we regularize the learning with click graphs by content-based classification to avoid propagating erroneous labels. We demonstrate the effectiveness of our algorithms in two different applications, product intent and job intent classification. In both cases, we expand the training data with automatically labeled queries by over two orders of magnitude, leading to significant improvements in classification performance. An additional finding is that with a large amount of training data obtained in this fashion, classifiers using only query words/phrases as features can work remarkably well.
SCGPred A Score%2Dbased Method for Gene Structure Prediction by Combining Multiple Sources of Evidence.

Transmitter Optimization and Beamforming Optimality Conditions for Double%2DScattering MIMO Channels.

Transmitter Optimization and Optimality of Beamforming for MIMO Systems in the Presence of Double Scattering.

Power Allocation for MIMO Systems with Channel Mean or Covariance Information Feedback.

The vocal joystick  evaluation of voice%2Dbased cursor control techniques.

A Protocol of Member%2DJoin in a Secret Sharing Scheme.

Statistical Transmit Antenna Selection for Correlated Rayleigh Fading MIMO Channels.

Algorithms for data%2Ddriven ASR parameter quantization.

A high%2Dspeed%2C low%2Dresource ASR back%2Dend based on custom arithmetic.
Abstract—With the skyrocketing popularity of mobile devices, new processing methods tailored to a specific application have become necessary for low-resource systems. This work presents a high-speed, low-resource speech recognition system using custom arithmetic units, where all system variables are represented by integer indices and all arithmetic operations are replaced by hardware-based table lookups. To this end, several reordering and rescaling techniques, including two accumulation structures for Gaussian evaluation and a novel method for the normalization of Viterbi search scores, are proposed to ensure low entropy for all variables. Furthermore, a discriminatively inspired distortion measure is investigated for scalar quantization of forward probabilities to maximize the recognition rate. Finally, heuristic algorithms are explored to optimize system-wide resource allocation. Our best bit-width allocation scheme only requires 59 kB of ROMs to hold the lookup tables, and its recognition performance with various vocabulary sizes in both clean and noisy conditions is nearly as good as that of a system using a 32-bit floating-point unit. Simulations on various architectures show that, on most modern processor designs, we can expect a cycle-count speedup of at least three times over systems with floating-point units. Additionally, the memory bandwidth is reduced by over 70 % and the offline storage for model parameters is reduced by 80%. Index Terms—Alpha recursion, bit-width allocation, custom arithmetic, discriminative distortion measure, forward probability normalization and scaling, high speed, low resource, normalization, quantization, speech recognition. I.
Sensor Localization in an Obstructed Environment.
Abstract. Sensor localization can be divided into two categories: rangebased approaches, and rang-free approaches. Although range-based approaches tend to be more accurate than range-free approaches, they are more sensitive to errors in distance measurement. Despite of the efforts on recovering sensors ’ Euclidean coordinates from erroneous distance measurements, as will be illustrated in this paper, they are still prone to distance errors, particularly in an obstruction abundant environment. In this paper, we propose a new algorithm for sensor localization based on Multiscale Radio Transmission Power(MRTP). It gradually increases the scale level of transmission power, and the distance is determined by the minimal scale of received signals. Unlike the range-based approaches, which treat each measured distance as an approximation of the true one, in our new approach, the measured distance serves as a constraint that limits the feasible location of sensors. Our simulations have shown that the MRTP-based approach is able to provide accurate and robust estimation of location, especially in an area abundant in obstructions, where most current approaches fail to perform well. 1
The Vocal Joystick A Voice%2DBased Human%2DComputer Interface for Individuals with Motor Impairments.
We present a novel voice-based humancomputer interface designed to enable individuals with motor impairments to use vocal parameters for continuous control tasks. Since discrete spoken commands are ill-suited to such tasks, our interface exploits a large set of continuous acousticphonetic parameters like pitch, loudness, vowel quality, etc. Their selection is optimized with respect to automatic recognizability, communication bandwidth, learnability, suitability, and ease of use. Parameters are extracted in real time, transformed via adaptation and acceleration, and converted into continuous control signals. This paper describes the basic engine, prototype applications (in particular, voice-based web browsing and a controlled trajectory-following task), and initial user studies confirming the feasibility of this technology. 1
Computational detection of microRNAs targeting transcription factor genes in Arabidopsis thaliana.

Using Rule Induction Methods to Analyze Gene Expression Data.

Overlay Topology Matching in P2P Systems.
Abstract-- The emerging peer-to-peer (P2P) model has gained significant attention due to its many unique features in supporting file sharing among a huge number of networked users. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical topology can cause a serious topology mismatching between the P2P overlay network and the physical underlying network. Adaptive overlay topology optimization and location-aware topology matching are two techniques aiming at alleviating the mismatching problem and reducing the unnecessary traffic and average query response time of unstructured P2P systems while still retaining the search scope. In this paper we compare the performance of these two approaches through simulation studies. 1
